- quadratic sieve factoring algorithm
- алгоритм факторизации методом квадратичногo решета
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
quadratic sieve factoring algorithm
Смотреть что такое "quadratic sieve factoring algorithm" в других словарях:
Quadratic sieve — The quadratic sieve algorithm (QS) is a modern integer factorization algorithm and, in practice, the second fastest method known (after the general number field sieve). It is still the fastest for integers under 100 decimal digits or so, and is… … Wikipedia
Quadratic residue — In number theory, an integer q is called a quadratic residue modulo n if it is congruent to a perfect square modulo n; i.e., if there exists an integer x such that: Otherwise, q is called a quadratic nonresidue modulo n. Originally an abstract… … Wikipedia
General number field sieve — In number theory, the general number field sieve (GNFS) is the most efficient classical algorithm known for factoring integers larger than 100 digits. Heuristically, its complexity for factoring an integer n (consisting of log2 n bits) is of … Wikipedia
Lenstra elliptic curve factorization — The Lenstra elliptic curve factorization or the elliptic curve factorization method (ECM) is a fast, sub exponential running time algorithm for integer factorization which employs elliptic curves. Technically, the ECM is classified as a… … Wikipedia
Williams' p + 1 algorithm — In computational number theory, Williams p + 1 algorithm is an integer factorization algorithm, one of the family of algebraic group factorisation algorithms. It was invented by Hugh C. Williams in 1982. It works well if the number N to be… … Wikipedia
Marvin Wunderlich — Marvin Charles Wunderlich (* 1937) ist ein US amerikanischer Mathematiker, der sich mit algorithmischer Zahlentheorie und speziell Faktorisierungsverfahren beschäftigt. Wunderlich promovierte 1964 bei William Edgar Briggs an der University of… … Deutsch Wikipedia
Binary matrix — In mathematics, particularly matrix theory, a binary matrix or (0,1) matrix is a matrix in which each entry is either zero or one. For example::egin{pmatrix}0 11 0end{pmatrix} is a 2 × 2 binary matrix.Frequently operations on binary matrices are … Wikipedia
Logical matrix — A logical matrix, binary matrix, relation matrix, Boolean matrix, or (0,1) matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets. Contents 1… … Wikipedia
Integer factorization — In number theory, integer factorization is the way of breaking down a composite number into smaller non trivial divisors, which when multiplied together equal the original integer.When the numbers are very large, no efficient integer… … Wikipedia
RSA numbers — In mathematics, the RSA numbers are a set of large semiprimes (numbers with exactly two prime factors) that are part of the RSA Factoring Challenge. The challenge was to find the prime factors but it was declared inactive in 2007. [RSA… … Wikipedia
List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic … Wikipedia
